One-sided epsilon-approximants
نویسندگان
چکیده
Given a finite point set P ⊂ R, we call a multiset A a one-sided weak ε-approximant for P (with respect to convex sets), if |P ∩ C|/|P | − |A ∩C|/|A| ≤ ε for every convex set C. We show that, in contrast with the usual (two-sided) weak ε-approximants, for every set P ⊂ R there exists a one-sided weak ε-approximant of size bounded by a function of ε and d.
منابع مشابه
Best one-sided L1 approximation to the Heaviside and sign functions
We find the polynomials of the best one-sided approximation to the Heaviside and sign functions. The polynomials are obtained by Hermite interpolation at the zeros of some Jacobi polynomials. Also we give an estimate of the error of approximation and characterize the extremal points of the convex set of the best approximants. c ⃝ 2012 Elsevier Inc. All rights reserved.
متن کاملSeries Prediction Based on Algebraic Approximants
Using sequence transformation and extrapolation algorithms for the prediction of further sequence elements from a finite number of known sequence elements is a topic of growing importance in applied mathematics. For a short introduction, see the book of Brezinski and Redivo Zaglia 1, Section 6.8 . We mention theoretical work on prediction properties of Padé approximants and related algorithms l...
متن کاملPubTeX output 1997.05.27:1654
Shannon’s celebrated source coding theorem can be viewed as a “one-sided law of large numbers.” We formulate second-order noiseless source coding theorems for the deviation of the codeword lengths from the entropy. For a class of sources that includes Markov chains we prove a “one-sided central limit theorem” and a law of the iterated logarithm.
متن کاملFraction-Free Computation of Matrix Rational Interpolants and Matrix GCDs
We present a new set of algorithms for computation of matrix rational interpolants and one-sided matrix greatest common divisors. Examples of these interpolants include Padé approximants, Newton–Padé, Hermite–Padé, and simultaneous Padé approximants, and more generally M-Padé approximants along with their matrix generalizations. The algorithms are fast and compute all solutions to a given probl...
متن کاملA complicated quasicrystal approximant ∊16 predicted by the strong-reflections approach
The structure of a complicated quasicrystal approximant epsilon(16) was predicted from a known and related quasicrystal approximant epsilon(6) by the strong-reflections approach. Electron-diffraction studies show that in reciprocal space, the positions of the strongest reflections and their intensity distributions are similar for both approximants. By applying the strong-reflections approach, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1603.05717 شماره
صفحات -
تاریخ انتشار 2016